Improving Abstract Interpretations by Systematic Lifting to the Powerset
نویسندگان
چکیده
Operators that systematically produce more precise abstract interpretations from simpler ones are interesting. In this paper we present a formal study of one such operator: the powerset. The main achievements of the paper are described below: • A formal definition of the powerset operator is given. For any given abstract interpretation D = 〈D, o1, . . . , ok〉, where D is the abstract domain and o1, . . . , ok are the abstract operations, this operator provides a new abstract interpretation P (D) = 〈P (D), o1, . . . , o ? k〉. Thus, the powerset concerns also the abstract operations oi , that are constructively defined from the oi’s. • A necessary and sufficient condition guaranteeing that P (D) is strictly better than D is given. • The general theory is applied to the well-known abstract interpretationPROP for ground-dependence analysis of logic programs. It is shown that P (PROP) is strictly better than PROP .
منابع مشابه
Universit a Di Pisa Functional Compositions of Abstract Interpretations Functional Compositions of Abstract Interpretations
In the context of standard abstract interpretation theory, we deene and study a systematic operator of reduced relative power for composing functionally abstract domains. The reduced relative power of two abstract domains D1 (the exponent) and D2 (the base) consists in a suitably deened lattice of monotone functions from D1 to D2, called dependencies, and it is a generalization of the Cousot an...
متن کاملA Coalgebraic Foundation for Linear Time Semantics
We present a coalgebraic approach to trace equivalence semantics based on lifting behaviour endofunctors for deterministic action to Kleisli categories of monads for non-deterministic choice. In Set , this gives a category with ordinary transition systems as objects and with morphisms characterised in terms of a linear notion of bisimulation. The final object in this category is the canonical a...
متن کاملGeneralized Strong Preservation by Abstract Interpretation
Many algorithms have been proposed for reducing the state space of a Kripke structure in order to obtain a minimal abstract structure that strongly preserves a given temporal specification language. These are partition refinement algorithms, namely they work on standard abstract models which are partitions of the state space States . In an abstract interpretation-based view, we show that state ...
متن کاملSymmetry groups for 3D dynamical systems
Abstract We present a systematic way to construct dynamical systems with a specific symmetry group G. Each symmetric strange attractor has a unique image attractor that is locally identical to it but different at the global topological level. Image attractors can be lifted to many inequivalent covering attractors. These are distinguished by an index that has related topological, algebraic and g...
متن کاملThe Many-valued Coalgebraic Cover Modality
The aim of Coalgebraic Logic is to find formalisms that allow reasoning about T-coalgebras uniformly in the functor T. Moss' seminal idea was to consider the set functor T as providing a modality ∇ T , the semantics of which is given in terms of the relation lifting of T. The latter exists whenever T preserves weak pullbacks. In joint work with Marta Bílková, Alexander Kurz and Jiří Velebil, we...
متن کامل